Transport lane usage

ABSTRACT

An example operation includes one or more of traveling, by a first transport, in a first lane, determining, by the first transport, that a speed of a second transport is greater than a speed of the first transport when the second transport is behind the first transport, determining, by the first transport, that no other transports are ahead of the first transport by a first distance in the first lane and beside the first transport by a second distance in a second lane, maneuvering, by the first transport, to the second lane allowing the second transport to pass the first transport in the first lane, and maneuvering, by the first transport, to the first lane when there are no other transports traveling in the first lane at a third distance behind the first transport and at or near the speed of the second transport.

TECHNICAL FIELD

This application is generally related to the maneuvering of transports,and more particularly, to transport lane usage.

BACKGROUND

Vehicles or transports, such as cars, motorcycles, trucks, planes,trains, etc., generally provide transportation needs to occupants and/orgoods in a variety of ways. Functions related to transports may beidentified and utilized by various computing devices, such as asmartphone or a computer, or a tablet.

Vehicles in motion may have issues that may be undetected by the driverand cause dangerous situations on the roadway. It is often difficult fora driver of a vehicle to be aware of issues that may have arisen whenthe vehicle is in route to a destination. Many accidents involvingtransports occur at highway exits. If a transport is moving fast in amiddle lane, it may not be able to exit the highway at high speedwithout creating an unsafe situation. In this situation, the transportneeds to contact other transports and resolve their speeds andpositioning in order to perform a safe maneuver or exit the highway. Inother words, an automated approach for improvement of the flow oftraffic and prevention of accidents through maneuvering of multipletransports is needed. Another situation that may become a problem iswhen a transport traveling faster comes up behind a slower transport inthe left-hand lane. A choice now needs to be made. In one case, thattransport may come up close to the slower transport with theunderstanding that the slower transport will understand that thetransport behind desires to proceed, and the slower transport will moveinto another lane. In another case, the faster transport will wait untilan opening occurs in another lane and will enter the lane, speed up andpass the slower transport while remaining in the other lane ormaneuvering back to the left lane. In both of the above examples, aswell as any situation where one transport is seeking to pass anothertransport (and maneuver back into the original lane) unsafe andinefficient driving situations may arise. Therefore, what is needed aresolutions to overcome these problems and limitations.

SUMMARY

One example embodiment may provide a method that includes one or more ofdetecting, by a processor of a transport, an exit on a road,calculating, by the processor of the transport, a probability that thetransport is not prepared to exit, requesting, by the processor of thetransport, at least one other transport proximate to the transport toalter its speed if the probability exceeds a threshold, and responsiveto detecting an altering of the speed by the at least one othertransport, triggering the transport to exit the road.

Another example embodiment may provide a method that includes one ormore of obtaining, by a moving vehicle, a first data including one ormore of at least one first video and at least one first image of amoving transport, analyzing the first data, by the moving vehicle, todetermine an initial issue, querying, by the moving vehicle, a serverfor a second data based on the analyzing, wherein the second data is oneor more of at least one second video and at least one second image ofthe moving transport at a previous time, verifying, by the movingvehicle, an issue exists based on a delta above a threshold between thefirst data and the second data, and sending, by the moving vehicle, theverified issue to the server.

Yet another example embodiment may provide a method that includes one ormore of traveling, by a first transport, in a first lane, determining,by the first transport, that a speed of a second transport is greaterthan a speed of the first transport when the second transport is behindthe first transport, determining, by the first transport, that no othertransports are ahead of the first transport by a first distance in thefirst lane and beside the first transport by a second distance in asecond lane, maneuvering, by the first transport, to the second laneallowing the second transport to pass the first transport in the firstlane, and maneuvering, by the first transport, to the first lane whenthere are no other transports traveling in the first lane at a thirddistance behind the first transport and at or near the speed of thesecond transport.

Another example embodiment may provide a system that includes aprocessor and memory, wherein the processor is configured to perform oneor more of detect an exit on a road, calculate a probability that thetransport is not prepared to exit, request at least one other transportproximate to the transport to alter its speed if the probability exceedsa threshold, and responsive to a detection of an altering of the speedby the at least one other transport, trigger the transport to exit theroad.

Another example embodiment may provide a system that includes aprocessor and memory, wherein the processor is configured to perform oneor more of obtain, by a moving vehicle, a first data including one ormore of at least one first video and at least one first image of amoving transport, analyze the first data, by the moving vehicle, todetermine an initial issue, query, by the moving vehicle, a server for asecond data based on the analysis, wherein the second data is one ormore of at least one second video and at least one second image of themoving transport at a previous time, verify, by the moving vehicle, anissue exists based on a delta above a threshold between the first dataand the second data, and send, by the moving vehicle, the verified issueto the server.

Yet another example embodiment may provide a system that includes aprocessor and memory, wherein the processor is configured to perform oneor more of determine that a speed of a second transport is greater thana speed of a first transport when the second transport is behind thefirst transport and the first transport is traveling in a first lane,determine that no other transports are ahead of the first transport by afirst distance in the first lane and beside the first transport by asecond distance in a second lane, maneuver to the second lane allowingthe second transport to pass the first transport in the first lane, andmaneuver to the first lane when there are no other transports in thefirst lane at a third distance behind the first transport and at or nearthe speed of the second transport.

A further example embodiment provides a non-transitory computer readablemedium comprising instructions, that when read by a processor, cause theprocessor to perform one or more of detecting an exit on a road,calculating a probability that the transport is not prepared to exit,requesting at least one other transport proximate to the transport toalter its speed if the probability exceeds a threshold, and responsiveto the detecting of an altering of the speed by the at least one othertransport, triggering the transport to exit the road.

A further example embodiment provides a non-transitory computer readablemedium comprising instructions, that when read by a processor, cause theprocessor to perform one or more of obtaining, by a moving vehicle, afirst data including one or more of at least one first video and atleast one first image of a moving transport, analyzing the first data,by the moving vehicle, to determine an initial issue, querying, by themoving vehicle, a server for a second data based on the analyzing,wherein the second data is one or more of at least one second video andat least one second image of the moving transport at a previous time,verifying, by the moving vehicle, an issue exists based on a delta abovea threshold between the first data and the second data, and sending, bythe moving vehicle, the verified issue to the server.

Yet a further example embodiment provides a non-transitory computerreadable medium comprising instructions, that when read by a processor,cause the processor to perform one or more of traveling, by a firsttransport, in a first lane, determining, by the first transport, that aspeed of a second transport is greater than a speed of the firsttransport when the second transport is behind the first transport,determining, by the first transport, that no other transports are aheadof the first transport by a first distance in the first lane and besidethe first transport by a second distance in a second lane, maneuvering,by the first transport, to the second lane allowing the second transportto pass the first transport in the first lane, and maneuvering, by thefirst transport, to the first lane when there are no other transportstraveling in the first lane at a third distance behind the firsttransport and at or near the speed of the second transport.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates a transport(s) network diagram in accordance to theexample embodiments.

FIG. 1B illustrates an example network diagram including a transportnode, according to example embodiments.

FIG. 1C illustrates another example network diagram including atransport node, according to example embodiments.

FIG. 1D illustrates yet another example network diagram including atransport node, according to example embodiments.

FIG. 1E illustrates a further example network diagram including atransport node, according to example embodiments.

FIG. 1F illustrates an example network diagram, according to exampleembodiments.

FIG. 1G illustrates an example diagram of transports on a road,according to example embodiments.

FIG. 1H illustrates another example diagram of transports on a road,according to example embodiments.

FIG. 1I illustrates a further example diagram of transports on a road,according to example embodiments.

FIG. 1J illustrates yet a further example network diagram including atransport node, according to example embodiments.

FIG. 1K illustrates yet a further example network diagram including atransport node, according to example embodiments.

FIG. 2A illustrates a blockchain architecture configuration, accordingto example embodiments.

FIG. 2B illustrates another blockchain configuration, according toexample embodiments.

FIG. 2C illustrates a blockchain configuration for storing blockchaintransaction data, according to example embodiments.

FIG. 3A illustrates a flow diagram, according to example embodiments.

FIG. 3B illustrates another flow diagram, according to exampleembodiments.

FIG. 3C illustrates a further flow diagram, according to exampleembodiments.

FIG. 3D illustrates yet a further flow diagram, according to exampleembodiments.

FIG. 3E illustrates a further flow diagram, according to exampleembodiments.

FIG. 3F illustrates yet a further flow diagram, according to exampleembodiments.

FIG. 3G illustrates a further flow diagram, according to exampleembodiments.

FIG. 3H illustrates yet a further flow diagram, according to exampleembodiments.

FIG. 3I illustrates yet a further flow diagram according to exampleembodiments.

FIG. 3J illustrates yet a further flow diagram according to exampleembodiments.

FIG. 4A illustrates an example blockchain vehicle configuration formanaging blockchain transactions associated with a vehicle, according toexample embodiments.

FIG. 4B illustrates another example blockchain vehicle configuration formanaging blockchain transactions between a service center and a vehicle,according to example embodiments.

FIG. 4C illustrates yet another example blockchain vehicle configurationfor managing blockchain transactions conducted among various vehicles,according to example embodiments

FIG. 5 illustrates example data blocks, according to exampleembodiments.

FIG. 6 illustrates an example system that supports one or more of theexample embodiments.

DETAILED DESCRIPTION

It will be readily understood that the instant components, as generallydescribed and illustrated in the figures herein, may be arranged anddesigned in a wide variety of different configurations. Thus, thefollowing detailed description of the embodiments of at least one of amethod, apparatus, non-transitory computer readable medium and system,as represented in the attached figures, is not intended to limit thescope of the application as claimed but is merely representative ofselected embodiments.

The instant features, structures, or characteristics as describedthroughout this specification may be combined in any suitable manner inone or more embodiments. For example, the usage of the phrases “exampleembodiments”, “some embodiments”, or other similar language, throughoutleast this specification refers to the fact that a particular feature,structure, or characteristic described in connection with the embodimentmay be included in at one embodiment. Thus, appearances of the phrases“example embodiments”, “in some embodiments”, “in other embodiments”, orother similar language, throughout this specification do not necessarilyall refer to the same group of embodiments, and the described features,structures, or characteristics may be combined in any suitable manner inone or more embodiments. In the diagrams, any connection betweenelements can permit one-way and/or two-way communication even if thedepicted connection is a one-way or two-way arrow. In the currentapplication, a transport may include one or more of cars, trucks,motorcycles, scooters, bicycles, boats, recreational vehicles, planes,and any object that may be used to transport people and or goods fromone location to another.

In addition, while the term “message” may have been used in thedescription of embodiments, the application may be applied to many typesof network data, such as, a packet, frame, datagram, etc. The term“message” also includes packet, frame, datagram, and any equivalentsthereof. Furthermore, while certain types of messages and signaling maybe depicted in exemplary embodiments they are not limited to a certaintype of message, and the application is not limited to a certain type ofsignaling.

Example embodiments provide methods, systems, components, non-transitorycomputer readable media, devices, and/or networks, which provide atleast one of: a transport (also referred to as a vehicle herein) a datacollection system, a data monitoring system, a verification system, anauthorization system and a vehicle data distribution system. The vehiclestatus condition data, received in the form of communication updatemessages, such as wireless data network communications and/or wiredcommunication messages, may be received and processed to identifyvehicle/transport status conditions and provide feedback as to thecondition changes of a transport. In one example, a user profile may beapplied to a particular transport/vehicle to authorize a current vehicleevent, service stops at service stations, and to authorize subsequentvehicle rental services.

Within the communication infrastructure, a decentralized database is adistributed storage system, which includes multiple nodes thatcommunicate with each other. A blockchain is an example of adecentralized database, which includes an append-only immutable datastructure (i.e., a distributed ledger) capable of maintaining recordsbetween untrusted parties. The untrusted parties are referred to hereinas peers, nodes or peer nodes. Each peer maintains a copy of thedatabase records and no single peer can modify the database recordswithout a consensus being reached among the distributed peers. Forexample, the peers may execute a consensus protocol to validateblockchain storage entries, group the storage entries into blocks, andbuild a hash chain via the blocks. This process forms the ledger byordering the storage entries, as is necessary, for consistency. In apublic or permissionless blockchain, anyone can participate without aspecific identity. Public blockchains can involve crypto-currencies anduse consensus based on various protocols such as proof of work (PoW). Onthe other hand, a permissioned blockchain database provides a system,which can secure interactions among a group of entities which share acommon goal, but which do not or cannot fully trust one another, such asbusinesses that exchange funds, goods, information, and the like. Theinstant application can function in a permissioned and/or apermissionless blockchain setting.

Smart contracts are trusted distributed applications which leveragetamper-proof properties of the shared or distributed ledger (i.e., whichmay be in the form of a blockchain) database and an underlying agreementbetween member nodes which is referred to as an endorsement orendorsement policy. In general, blockchain entries are “endorsed” beforebeing committed to the blockchain while entries, which are not endorsed,are disregarded. A typical endorsement policy allows smart contractexecutable code to specify endorsers for an entry in the form of a setof peer nodes that are necessary for endorsement. When a client sendsthe entry to the peers specified in the endorsement policy, the entry isexecuted to validate the entry. After validation, the entries enter anordering phase in which a consensus protocol is used to produce anordered sequence of endorsed entries grouped into blocks.

Nodes are the communication entities of the blockchain system. A “node”may perform a logical function in the sense that multiple nodes ofdifferent types can run on the same physical server. Nodes are groupedin trust domains and are associated with logical entities that controlthem in various ways. Nodes may include different types, such as aclient or submitting-client node which submits an entry-invocation to anendorser (e.g., peer), and broadcasts entry-proposals to an orderingservice (e.g., ordering node). Another type of node is a peer node,which can receive client submitted entries, commit the entries andmaintain a state and a copy of the ledger of blockchain entries. Peerscan also have the role of an endorser, although it is not a requirement.An ordering-service-node or orderer is a node running the communicationservice for all nodes, and which implements a delivery guarantee, suchas a broadcast to each of the peer nodes in the system when committingentries and modifying a world state of the blockchain, which is anothername for the initial blockchain entry, which normally includes controland setup information.

A ledger is a sequenced, tamper-resistant record of all statetransitions of a blockchain. State transitions may result from smartcontract executable code invocations (i.e., entries) submitted byparticipating parties (e.g., client nodes, ordering nodes, endorsernodes, peer nodes, etc.). An entry may result in a set of assetkey-value pairs being committed to the ledger as one or more operands,such as creates, updates, deletes, and the like. The ledger includes ablockchain (also referred to as a chain), which is used to store animmutable, sequenced record in blocks. The ledger also includes a statedatabase, which maintains a current state of the blockchain. There istypically one ledger per channel. Each peer node maintains a copy of theledger for each channel of which they are a member.

A chain is an entry log, which is structured as hash-linked blocks, andeach block contains a sequence of N entries where N is equal to orgreater than one. The block header includes a hash of the block'sentries, as well as a hash of the prior block's header. In this way, allentries on the ledger may be sequenced and cryptographically linkedtogether. Accordingly, it is not possible to tamper with the ledger datawithout breaking the hash links. A hash of a most recently addedblockchain block represents every entry on the chain that has comebefore it, making it possible to ensure that all peer nodes are in aconsistent and trusted state. The chain may be stored on a peer nodefile system (i.e., local, attached storage, cloud, etc.), efficientlysupporting the append-only nature of the blockchain workload.

The current state of the immutable ledger represents the latest valuesfor all keys that are included in the chain entry log. Because thecurrent state represents the latest key values known to a channel, it issometimes referred to as a world state. Smart contract executable codeinvocations execute entries against the current state data of theledger. To make these smart contract executable code interactionsefficient, the latest values of the keys may be stored in a statedatabase. The state database may be simply an indexed view into thechain's entry log, it can therefore be regenerated from the chain at anytime. The state database may automatically be recovered (or generated ifneeded) upon peer node startup, and before entries are accepted.

A blockchain is different from a traditional database in that theblockchain is not a central storage but rather a decentralized,immutable, and secure storage, where nodes must share in changes torecords in the storage. Some properties that are inherent in blockchainand which help implement the blockchain include, but are not limited to,an immutable ledger, smart contracts, security, privacy,decentralization, consensus, endorsement, accessibility, and the like.

Example embodiments provide a way for providing a vehicle service to aparticular vehicle and/or requesting user associated with a user profilethat is applied to the vehicle. For example, a user may be the owner ofa vehicle or the operator of a vehicle owned by another party. Thevehicle may require service at certain intervals and the service needsmay require authorization prior to permitting the services to bereceived. Also, service centers may offer services to vehicles in anearby area based on the vehicle's current route plan and a relativelevel of service requirements (e.g., immediate, severe, intermediate,minor, etc.). The vehicle needs may be monitored via one or moresensors, which report sensed data to a central controller computerdevice in the vehicle, which in turn, is forwarded to a managementserver for review and action.

A sensor may be located on one or more of the interior of the transport,the exterior of the transport, on a fixed object apart from thetransport, and on another transport near to the transport. The sensormay also be associated with the transport's speed, the transport'sbraking, the transport's acceleration, fuel levels, service needs, thegear-shifting of the transport, the transport's steering, and the like.The notion of a sensor may also be a device, such as a mobile device.Also, sensor information may be used to identify whether the vehicle isoperating safely and whether the occupant user has engaged in anyunexpected vehicle conditions, such as during the vehicle access period.Vehicle information collected before, during and/or after a vehicle'soperation may be identified and stored in a transaction on ashared/distributed ledger, which may be generated and committed to theimmutable ledger as determined by a permission granting consortium, andthus in a “decentralized” manner, such as via a blockchain membershipgroup. Each interested party (i.e., company, agency, etc.) may want tolimit the exposure of private information, and therefore the blockchainand its immutability can limit the exposure and manage permissions foreach particular user vehicle profile. A smart contract may be used toprovide compensation, quantify a user profile score/rating/review, applyvehicle event permissions, determine when service is needed, identify acollision and/or degradation event, identify a safety concern event,identify parties to the event and provide distribution to registeredentities seeking access to such vehicle event data. Also, the resultsmay be identified, and the necessary information can be shared among theregistered companies and/or individuals based on a “consensus” approachassociated with the blockchain. Such an approach could not beimplemented on a traditional centralized database.

Every autonomous driving system is built on a whole suite of softwareand an array of sensors. Machine learning, lidar projectors, radar, andultrasonic sensors all work together to create a living map of the worldthat a self-driving car can navigate. Most companies in the race to fullautonomy are relying on the same basic technological foundations oflidar+radar+cameras+ultrasonic, with a few notable exceptions.

In another embodiment, GPS, maps and other cameras and sensors are usedin an autonomous vehicles without lidar as lidar is often viewed asbeing expensive and unnecessary. Researchers have determined that stereocameras are a low-cost alternative to the more expensive lidarfunctionality.

The instant application includes, in certain embodiments, authorizing avehicle for service via an automated and quick authentication scheme.For example, driving up to a charging station or fuel pump may beperformed by a vehicle operator, and the authorization to receive chargeor fuel may be performed without any delays provided the authorizationis received by the service station. A vehicle may provide acommunication signal that provides an identification of a vehicle thathas a currently active profile linked to an account that is authorizedto accept a service, which can be later rectified by compensation.Additional measures may be used to provide further authentication, suchas another identifier may be sent from the user's device wirelessly tothe service center to replace or supplement the first authorizationeffort between the transport and the service center with an additionalauthorization effort.

Data shared and received may be stored in a database, which maintainsdata in one single database (e.g., database server) and generally at oneparticular location. This location is often a central computer, forexample, a desktop central processing unit (CPU), a server CPU, or amainframe computer. Information stored on a centralized database istypically accessible from multiple different points. A centralizeddatabase is easy to manage, maintain, and control, especially forpurposes of security because of its single location. Within acentralized database, data redundancy is minimized as a single storingplace of all data also implies that a given set of data only has oneprimary record.

According to the exemplary embodiments, a transport computer systemdetects an upcoming exit and determines if the transport is prepared toexit safely. If, for example, the transport is traveling in theincorrect lane or traveling at a speed that is not conducive to makingthe upcoming exit safely, the transport computer instructs the subjecttransport as well as other proximate transports to allow the subjecttransport to exit in a safe manner. The transport computer may connectto other transports and acquire consensus for altering speed andperforming other maneuvers so the transport may exit safely. All of thetransports may serve as dynamic blockchain peers. This way thecommunication between the transports is implemented over a blockchainnetwork. The determination of safety level for transport's maneuvers maybe implemented by execution of a smart contract.

In another embodiment, a transport may be traveling within a caravan(e.g., a military platoon) and the lead transport may contact all othertransports and may a consensus from all other transports forimplementing a safe maneuver by the entire caravan. The communicationbetween the transports is implemented over a blockchain network all ofthe transports belong to. The determination of safety level forcaravan's maneuvers may be implemented by execution of a smart contract.

The current system allows for one or more vehicles working together toassess issues related to a transport while in motion. This allows foritems to be assessed in real-world driving conditions (verses forexample, in a repair shop or at a dealer). These items can includetesting such as covers to the rear and front lights, the undercarriageof the vehicle, the condition of the license plate, the motion andeffectiveness of wipers, the alignment/steering of the tires, etc.

The current system allows for at least one vehicle to assess anothertransport. In another embodiments, other vehicles can further assess thetransport (in a similar location and/or period of time. This assessmentis performed via sensors on the one or more vehicles capturing data suchas image, video, or the like of the transport.

The data related to the assessment are sent to a server via a network.The data is then analyzed, and the results of the analysis are sent tothe transport (and/or to a driver of the transport). If the transport isautonomous, the transport can utilize the data to attempt to correct theissues (which may include the driving of the transport to adealer/repair store. In a non-autonomous setting, the information can beused by the driver of the transport to correct the issues, which mayinclude a replacement of noted, defective parts or issues. In anotherembodiment, the one or more vehicles can perform the assessment and theanalysis without providing data to the server and send the result of theanalysis directly to the transport via, for example V2V communications.

The items assessed on the transport include (but not limited to)includes tire appearance (low tire, tire bald, out of balance/alignment,etc.), driver appearance (head down, inattentive, texting, sleepy,etc.), brake lights, headlights, fog lights, etc., trunk/door appearance(open, damage), brake/headlight covers (foggy, dirty), license platecheck, front and back, damage to transport body, undercarriage(something dragging), valid registration and/or inspection.

Images, video, etc. of the items are sent to the server and analyzed.The analysis includes a comparison of the images/videos of the transportto known, proper images/videos of similar transports.

In another embodiment, the images/videos can be compared to known,proper images/videos and the transport itself (which may be provided bythe one or more vehicles at a previous instance, or images/videos of thetransport from the server.) In one embodiment, an initial assessment ofthe items can be made by the one or more vehicles, and if the initialassessment results in a potential issue, then the data is sent to theserver. In such a scenario, another vehicle of the one or more vehiclescan assess the item/items that the one or more vehicles analyzed ashaving an issue. The initial assessment, as well as the secondassessment (as a validation) all occur while the at least one vehicle,the other vehicle, and the transport are all in motion and/ortemporarily stop before and after being in motion (for example, at astop sign, light, in traffic, etc.)

In another embodiment, the at least one vehicle and/or the other vehiclecan query the transport for data related to the issue(s). In such ascenario, the transport would provide the data (acquired from one ormore sensors on the transport) to the one or more vehicles and/or theother vehicle via V2V communications. In another embodiment, the datafrom the transport can also be provided to the server. The data from thetransport, along with the data from the one or more vehicle and/or theother vehicles can be analyzed to determine if an issue(s) exist, theseverity of issue(s), and/or a proposed solution to the issue(s).

Data received from the at least one vehicle, the other vehicle, and thetransport can further be analyzed based on weather conditions, roadconditions, driving conditions, and the like to better assess apotential issue(s). For example, if the tires of the transport areassessed to be an issue, if there is ice on the road, an issue mayactually may not exist. Further assessment can be performed to make afuller determination of that initial analysis.

In another embodiment, the transport self-analyzes (via one or moresensors on the transport) the items to determine if issue(s) exists.This self-analysis is based on data/parameters that are considerednormal/adequate. For example, during self-analysis, the sensor maydetermine that the braking is not adequate based on proper petalpressure/braking response data. In such a scenario, the transport mayinform the one or more other vehicles and/or the server of the situationand a further visual analysis can be performed by the one or morevehicles and/or the other vehicle. The data from the transport as wellas the image(s)/video(s) can be collectively analyzed by the server todetermine if an issue(s), the severity of issue(s), and/or a proposedsolution to the issue(s).

In another embodiment, video(s)/image(s) are zoomed to a location of theissue(s) and sent to the server for analysis. The zooming may berequested by the server to further aid in the analysis of the data.

In one embodiment, the video(s)/images(s) can be taken by cameras fromother moving objects, such as drones, planes, satellites, etc. and fixedobjects such as streetlights, traffic lights, buildings, and the like.

Image(s)/video(s) of the transport can be taken from every side and thetop of the transport by one or more moving and/or fixed objects.

In a further embodiment, the transport may identify a first transport ina group of transports traveling on a route, maneuver the first transportto be proximate to a second transport in the group, perform a firstvalidation of at least one element of the second transport, by the firsttransport, perform a second validation of the at least one function ofthe second transport, by at least one other transport in the group oftransports, and notify one or more of the second transport and at leastone occupant in the second transport, based on one or more of the firstvalidating and the second validating.

A transport, vehicle, or car, may be referred to as transports,vehicles, and cars and can include other objects such as motorcycles,busses, bicycles, scooters, boats, drones, trains, and/or any otherobject that can transport individuals and/or goods.

The current system describes a first transport taking video/images of asecond transport. If the video/images indicate an initial issue exists(brake lights, head lights, cracked windshield, debris under the car,etc.), the first transport receives previous video/images of the secondtransport operating normally from a server and compares them todetermine if an issue exists.

When describing “near the speed”, this can mean above the speed or belowthe speed of the respective transport.

FIG. 1A illustrates a transport(s) network diagram 100 in accordance tothe exemplary embodiments. According to one exemplary embodiment, atransport's 102 processor 104 may detect that the transport 102 isapproaching an exit on a road. The processor 104 may calculate aprobability that the transport 102 is not prepared to exit. Theprobability may be calculated based on speed of the transport, speed oftraffic, position on the road (i.e., the lane) and a distance to theexit and to other transports. The processor 104 may contact othertransports 105 proximate to the transport to request the transport(s)105 to alter its speed (or position) if the probability of unsafe exitby the transport 102 exceeds a threshold. Once the processor 104 of thetransport 102 detects that the transport(s) 105 have altered its speed,the processor 104 my trigger the transport 102 to exit the road.

According to another exemplary embodiment, the transport 102 may be apart of a caravan of the transport 105. The transport 102 may send arequest to perform a maneuver to a other transports 105 in the caravan.The transport 102 may receive blockchain consensus from the transports105 for performing the maneuver. Then, the transport 102 may acquire thespeed and distance between the transports 105 in the caravan. Thetransport 102 may analyze the measurements to determine a safety levelof the maneuver of the caravan. Then, the transport 102 may send acommand to perform the maneuver to the transports 105 in the caravan, ifthe safety level exceeds a threshold.

FIG. 1B illustrates a network diagram for insuring safety of transportmaneuvering. Referring to FIG. 1B, the network diagram 111 includes atransport node 102 connected to other transport nodes 105 over ablockchain network 106. The transport nodes 102 and 105 may representtransports/vehicles. The blockchain network 106 may have ledger 108 forstoring data, such as safety threshold-related data and transactions110, that record the probability information, timestamps, and otherrelated data.

While this example describes in detail only one transport node 102,multiple such nodes may be connected to the blockchain 106. It should beunderstood that the transport node 102 may include additional componentsand that some of the components described herein may be removed and/ormodified without departing from a scope of the transport node 102disclosed herein. The transport node 102 may have a computing device ora server computer, or the like, and may include a processor 104, whichmay be a semiconductor-based microprocessor, a central processing unit(CPU), an application specific integrated circuit (ASIC), afield-programmable gate array (FPGA), and/or another hardware device.Although a single processor 104 is depicted, it should be understoodthat the transport node 102 may include multiple processors, multiplecores, or the like, without departing from the scope of the transportnode 102 system.

The transport node 102 may also include a non-transitory computerreadable medium 112 that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 114-120 and are furtherdiscussed below. Examples of the non-transitory computer readable medium112 may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 112 may be a RandomAccess memory (RAM), an Electrically Erasable Programmable Read-OnlyMemory (EEPROM), a hard disk, an optical disc, or other type of storagedevice.

The processor 104 may execute the machine-readable instructions 114 todetect an exit on a road. Each of the transports 102 and 105 may serveas a network node on a blockchain network 106. As discussed above, theblockchain ledger 108 may store safety thresholds and transactions 110.The blockchain 106 network may be configured to use one or more smartcontracts located on the transports (i.e., nodes) that may managetransactions for other participating transport nodes 105. The transportnode 102 may provide the safety information to the blockchain 106 to bestored on a ledger 108.

The processor 104 may execute the machine-readable instructions 116 tocalculate a probability that the transport 102 is not prepared to exit.The processor 104 may execute the machine-readable instructions 118 torequest at least one other transport 115 proximate to the transport 102to alter its speed if the probability exceeds a threshold. The processor104 may execute the machine-readable instructions 120 to responsive to adetecting of an altering of the speed by the at least one othertransport, trigger the transport 102 to exit the road.

FIG. 1C illustrates a network diagram for insuring safety of transportmaneuvering. Referring to FIG. 1C, the network diagram 121 includes atransport node 102 (e.g., a vehicle) connected to other transport nodes105 over a blockchain network 106 that has a ledger 108 for storingsafety data (e.g., threshold) and transactions 110. The transport nodes102 and 105 may serve as blockchain 106 peers. While this exampledescribes in detail only one transport node 102, multiple such nodes maybe connected to the blockchain 106. It should be understood that thetransport node 102 may include additional components and that some ofthe components described herein may be removed and/or modified withoutdeparting from a scope of the transport node 102 disclosed herein. Thetransport node 102 may have a computing device or a server computer, orthe like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the transportnode 102 may include multiple processors, multiple cores, or the like,without departing from the scope of the transport node 102.

The transport node 102 may also include a non-transitory computerreadable medium 112′ that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 113-119 and are furtherdiscussed below. Examples of the non-transitory computer readable medium112′ may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 112′ may be aRandom Access memory (RAM), an Electrically Erasable ProgrammableRead-Only Memory (EEPROM), a hard disk, an optical disc, or other typeof storage device.

The processor 104 may execute the machine-readable instructions 113 todetect an intention to prepare to take an exit. The blockchain 106 maybe configured to use one or more smart contracts that managetransactions for multiple participating nodes (e.g., 105 and 102). Thetransport node 102 may provide safety-related information to theblockchain 106 and this transaction may be stored on the ledger 108.

The processor 104 may execute the machine-readable instructions 115 toacquire distance and speed measurements. The processor 104 may executethe machine-readable instructions 117 to calculate a probability of asafe exit by the transport 102 based on the measurements. The processor104 may execute the machine-readable instructions 119 to in response tothe probability being below a threshold, request at least one transportfrom a plurality of the transports proximate to the transport 102 toperform a maneuver to allow for the safe exit of the transport 102.

FIG. 1D illustrates a network diagram for insuring safety of transportmaneuvering. Referring to FIG. 1D, the network diagram 123 includes atransport node 102 (e.g., a vehicle) connected to other transport nodes105 over a blockchain network 106 that has a ledger 108 for storingsafety-related information and transactions 110. The transport nodes 102and 105 may serve as blockchain 106 peers. While this example describesin detail only one transport node 102, multiple such nodes may beconnected to the blockchain 106. It should be understood that thetransport node 102 may include additional components and that some ofthe components described herein may be removed and/or modified withoutdeparting from a scope of the transport node 102 disclosed herein. Thetransport node 102 may have a computing device or a server computer, orthe like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the transportnode 102 may include multiple processors, multiple cores, or the like,without departing from the scope of the transport node 102.

The transport node 102 may also include a non-transitory computerreadable medium 112″ that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 130-138 and are furtherdiscussed below. Examples of the non-transitory computer readable medium112″ may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 112″ may be aRandom Access memory (RAM), an Electrically Erasable ProgrammableRead-Only Memory (EEPROM), a hard disk, an optical disc, or other typeof storage device.

The processor 104 may execute the machine-readable instructions 130 tosend a request to perform a maneuver to a plurality of transports 105 ina caravan. The blockchain 106 may be configured to use one or more smartcontracts that manage transactions for multiple participating nodes 102and 105. The transport node 102 may provide safety-related informationto the blockchain 106 and this transaction may be stored on the ledger108.

The processor 104 may execute the machine-readable instructions 132 toreceive agreements from the plurality of the transports 105. Theprocessor 104 may execute the machine-readable instructions 134 toresponsive to the agreements, acquire speed and distance measurements ofthe caravan. The processor 104 may execute the machine-readableinstructions 136 to analyze the measurements to determine a safety levelof the maneuver. The processor 104 may execute the machine-readableinstructions 138 to send a command to perform the maneuver to theplurality of the transports 105 in the caravan, if the safety levelexceeds a threshold.

FIG. 1E illustrates a network diagram for insuring safety of transportmaneuvering. Referring to FIG. 1E, the network diagram 125 includes atransport node 102 (e.g., a vehicle) connected to other transport nodes105 over a blockchain network 106 that has a ledger 108 for storingsafety-related information and transactions 110. The transport nodes 102and 105 may serve as blockchain 106 peers. While this example describesin detail only one transport node 102, multiple such nodes may beconnected to the blockchain 106. It should be understood that thetransport node 102 may include additional components and that some ofthe components described herein may be removed and/or modified withoutdeparting from a scope of the transport node 102 disclosed herein. Thetransport node 102 may have a computing device or a server computer, orthe like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the transportnode 102 may include multiple processors, multiple cores, or the like,without departing from the scope of the transport node 102.

The transport node 102 may also include a non-transitory computerreadable medium 112′″ that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 133-139 and are furtherdiscussed below. Examples of the non-transitory computer readable medium112′″ may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 112′″ may be aRandom Access memory (RAM), an Electrically Erasable ProgrammableRead-Only Memory (EEPROM), a hard disk, an optical disc, or other typeof storage device.

The processor 104 may execute the machine-readable instructions 133 toacquire a plurality of measurements of a caravan comprising a pluralityof transports 105. The blockchain 106 may be configured to use one ormore smart contracts that manage transactions for multiple participatingnodes 102 and 105. The transport node 102 may provide safety-relatedinformation to the blockchain 106 and this transaction may be stored onthe ledger 108.

The processor 104 may execute the machine-readable instructions 135 toanalyze the measurements based on information received from an externalsource (e.g., a highway infrastructure system). The processor 104 mayexecute the machine-readable instructions 137 to determine a safetylevel of the caravan based on the analysis. The processor 104 mayexecute the machine-readable instructions 139 to send a command toadjust travel parameters to a plurality of transports in a caravan inresponse to the safety level being below a threshold.

FIG. 1F illustrates an example network diagram 140, according to exampleembodiments. Functionality of the instant application is executed in theinstant application 150 (FIG. 1F), which may wholly or partially resideon one or more of the transports 142, 142′, 142″, the network 144, theserver 146, and any other element containing a processor and memory. Inone embodiment, the instant application includes one or more of codeexecuted in a processor in a transport, the processing of data fromsensors on a transport, receiving information from one or moreservers/databases/networks.

In one embodiment, the instant application describes a more intuitiveapproach to lane changing. The instant application informs a transportwhen the transport should and should not move into another lane. Thedecision is based on a number of factors including whether thetransport's (and other transports') positions, and/or recent speedswarrant the move into another lane.

The system of the instant application provides a number of advantageousresults including creating an efficient driving situation (cars aren'thaving to maneuver into a middle lane and back to get around a slowermoving transport), and a safe driving situation (overcomes an issue oftailgating and precludes the need for one transport to markedly increaseits speed to get around a slower transport).

In another embodiment, a transport is traveling down a road, such as atwo lane road. The transport is notified by the instant application thata lane switch is advised (i.e., the transport is in lane-A and shouldmove into lane-B. Before the transport moves into lane-B, the instantapplication (executing in the server 106, in one embodiment) determinescertain data which may be received at the server 106 via the network144, from the transport 142, 142′, 142″, The data may include one ormore of the current traffic speed of the lane, the current averagetraffic speed of the lane, the historical traffic speed of the lane, theposition of the transport, the speed of the transport, the position ofother transports, the speeds of the other transports, current weatherconditions, current road conditions, current visibility and the currenttime of day. The system notifies the transport when it is recommendedfor the transport to switch lanes based on an analysis of the certaindata. This notification may be sent from the instant applicationexecuting partially or wholly in the server 146, and messaging is sentfrom the server 146 to the transport(s) 142, 142′, 142″, in oneembodiment.

In another embodiment, the average traffic speed being greater or lessthan the current traffic speed is based on the current speed above orbelow a threshold.

FIG. 1F shows a network diagram 140 of one example of the instantapplication. Three transports (142, 142′, 142″) are present and may useprotocols that normally support vehicle to vehicle communication tocommunicate amongst each other (such as Dedicated Short-RangeCommunications (DSRC), cellular communication, Wi-Fi, Bluetooth, and thelike). The transports (142, 142′, 142″) may also be connected to anetwork 144, which may be a network such as a global network or Internetand communicate via a suitable wireless communication protocol, such asa wireless telephony (e.g. GSM, CDMA, LTE, etc.), Wi-Fi (802.11standards), WiMAX, Bluetooth, infrared or radio frequencycommunications, etc. A server 146 is coupled to the network and may havea database 148 coupled to or integrated with the server. Other databasesand servers may be present and connected to the network and may bedirectly or communicably coupled to the server 146 and the network 144.

The instant application 150 executes on a computer 152 containing aprocessor and memory. The computer may be fully or partially located onone or more of the transports (142, 142′, and 142″), the network 144,and the server 146.

In one embodiment, the server 146 is made aware of transports (142,142′, and 142″) by updates sent to the server 146 via the transports,wherein the updates are routed through the network 144 to the server146. These updates include position, speed, direction, etc. of thetransports which are obtained via sensors on the transports (142, 142′,and 142″) that communicate with the computer 152 on the transports (142,142′, and 142″).

In another embodiment, the location, speed, and direction of the firsttransport, second transport, and other transports (142′, 142′, 142″) maybe determined by one or more of the first transport, the secondtransport, the other transports, and the server.

FIG. 1G illustrates an example diagram of transports on a road 155,according to example embodiments. FIG. 1G shows a diagram 155 oftransports on a road that perform maneuvers where a potentiallydangerous situation arises. For example, a transport is desiring toproceed in a left-hand lane but is precluded from doing so because it isblocked by another transport. Using various communication protocols,such as transport to transport communication and notifications to othertransports and/or drivers or occupants, a potentially dangeroussituation can be averted.

Normally, the left-hand lane is the fastest travelling lane, the nextright lane is the next fastest travelling lane, and this continues untilthe farthest right-hand lane is normally the slowest traveling lane.Therefore, when a transport is traveling slower than the flow oftraffic, other transports may become impatient and dangerous situationsmay arise.

In one embodiment, the instant application is executing wholly orpartially on a processor on a transport. The processor may be part ofthe transport's infotainment system, a transport computer, or any otherdevice containing a processor and memory associated with the transport.All transports are coupled with the server 146 via the network 144. Theserver 146 communicates with the transports and may store data in adatabase 148 (FIG. 1F).

A first transport 162 is operating on a road in the first lane 173, anda second transport 164 is approaching the first transport 162 at ahigher speed. The second transport 164 is desiring to pass the firsttransport 162. This may be observed by the second transport 164operating at a close distance (otherwise known as ‘tailgating’). Othertransports 166 may be present on other lanes, such as a second lane 173,wherein the second transport 164 is unable to pass the first transport162. Other transports may also be present (not depicted) thatcontinually disallow the second transport 164 to pass the firsttransport 162.

The first transport 162 determines the speed and/or distance of othertransport proximate to it. This may be via sensors on the firsttransport 162 such as video cameras, V2V communication, or the like.

The instant application determines that no other transports (such astransport 168), are ahead of the first transport 162 by a first distance160 in a first lane 171. This determination verifies that no othertransports (such as transport 168) are ahead of the first transport 162less than the first distance 160. The first transport 162 should notallow the second transport 164 to pass (by the first transport 162occupying the second lane 173) if there is not enough room for thesecond transport 164 to travel ahead at a speed approximately equal toits current speed.

The instant application determines that there are no other transports(such as transport 166) beside the first transport 162 by a seconddistance 163 in the next right lane 173. This determination verifiesthat there is sufficient room for the transport 162 to maneuver into thenext right lane 173, and that no other transports (such as transport166) are present to not allow the maneuvering.

In another embodiment, the first transport 162 remains in the secondlane 173 when the second transport 164 and one or more additionaltransports 170 are moving at a faster speed in the first lane 171 thanthe first transport 162.

In another embodiment, the instant application will notify at least onedriver and/or occupant of the transports 162 and 164 via data such astext, voice, video and/or image to move into the second lane 173 and toproceed in the first lane 171, respectively. The data can appear on adisplay of the transport 162 with text such as “A transport behind youdesires to pass.” The text may also be displayed on a personal wirelessdevice (such as a cell phone of an occupant of transport 162), a HeadsUp Device (HUD), a display of the infotainment system, and the like. Inanother embodiment, a speech-to-text functionality of the instantapplication allows for spoken text through first transport 162 audiospeakers. In yet another embodiment, haptic functionality is performedon first transport 162, such as a vibrating of one or more of a driver'sseat, a vibrating of the right side of the steering wheel, and the like.

The first transport 162, now in the second lane 173 may maneuver backinto the first lane 171 when there are no other transport 170 travelingin the first lane 171 at a third distance 165 behind the first transport162 and at or near the speed of the second transport 164.

In an alternate embodiment, the first transport 162 may return to thefirst lane 171 when there are no other transports traveling near thesecond transport 164. For example, if there are transports behind thesecond transport 164, traveling at or near the speed of the secondtransport 164 and behind the second transport 164, then the firsttransport 162 will not maneuver back into the first lane 171.

In yet another alternate embodiment, the same functionality as depictedabove may be repeated using the second lane 173 as the first lane 171,and the third lane 175 as the second lane 173.

In yet a further embodiment, the same functionality depicted above withrespect to the first lane 171 and the second lane 173 may be repeatedusing a single lane (for example the first lane 171) and a shoulder nearthe single lane (for example, the second lane 173).

In yet a further embodiment, the first transport 162 returns to thefirst lane 171 only when there are no other transports traveling nearthe second transport 164.

When the first transport 162 is traveling below a speed limit, theinstant application sends an alert to at least one occupant of the firsttransport 162. Traveling below the current speed limit may be dangerousas other transports may not see the slower moving transport, adding tothe danger is that most transport normally travel above the currentspeed limit.

A transport may know the current speed limit by querying a navigationalfunction on the transport that normally is aware of a current speedlimit at a location. Utilizing this knowledge, the first transport 162,using sensors for example, will determine a delta between the currentspeed of the first transport 162 and the current speed limit. When thedelta is above a threshold, the instant application executing on acomputer associated with the first transport 162, such as a transportcomputer, creates a notification including text such as “You aretraveling below the speed limit” or the like. This message is shown tothe at least one occupant of the transport on a display of the firsttransport 162.

When the first transport 162 is in the second lane 173, maneuveringthere from a first lane 171 due to a second transport 164 desiring topass, the first transport 162 can maneuver into a slower lane such as athird lane 175 after: 1) A period of time that the first transport 162is moving below the speed limit (for example 30 seconds) and 2) a numberof alerts (for example, 3) have been sent.

In another embodiment, when the road is a 3-lane road, the third lane175 is typically the slowest moving lane. If the road is a 4-lane road,the third lane 175 is typically the second slowest lane. Thefunctionality described and depicted herein can occur on a single lane(with a shoulder) and/or on a road or highway with a plurality of laneswithout deviating from the scope of the instant application.

In another embodiment, the first transport 162 alerts one or more of thesecond transport 164 and other transports on the road to decrease theirspeed when the first transport 162 is unable to move into another lane,such as the second lane 173. This alerting may utilize V2V protocols,Bluetooth, Wi-Fi, cellular communication, or the like. This may helpalleviate frustration by occupants of the second transport 164 and theother transports as they may come to understand that while occupant(s)of the first transport 162 may desire to allow other transports to pass,they are unable to do so. The alerting may be received and executed onthe second transport 164 and other transports via data sent to at leastone display associated with the second transport 164 and othertransports, a vibrating of a portion of the transport such as a steeringwheel and/or a seat, and the like.

FIG. 1H illustrates another example diagram of transports on a road 180,according to example embodiments. FIG. 1H shows another diagram 180 oftransports on a road, where the first transport 162 has maneuvered 182from the first lane 171 to the second lane 173 to allow the secondtransport 164 to pass first transport 162 in the first lane 171. In oneembodiment, the instant application is configured to perform (or assistin performing) this activity by the maneuvering the first transport 162when first transport 162 is an autonomous transport. In anotherembodiment, the instant application is configured to perform (or assistin performing) sending a notification to a driver and/or passenger(s) ofthe transport 162 to maneuver to the second lane 173 and sending anotification to a driver and/or passenger(s) of the transport 164 toproceed ahead in the first lane 171.

FIG. 1I illustrates a further example diagram of transports on a road190, according to example embodiments. FIG. 1I shows another diagram 190of transports on a road. The transports (162, 164, 166, 168) sendtransport data 192 to a server 146 (via the network 144). The transportdata 192 contains data such as the current direction, speed, location,time, acceleration rate, deceleration rate, make, model, year, mileage,maintenance activities, number of sensors, sensor types, location ofsensors, operability of sensors, etc. of the transport, data fromsensors on the transport, camera data, occupant data, and othertransport-related data. This information may be stored in a databasesuch as Database 148, for analysis. The server 146 sends result data 194to a transport (such as transport 164) of an event. For example, anevent may be transport 164 desiring to pass the transport 162. This isindicated by the transport 164 traveling close to the first transport162, otherwise known as ‘tailgating’ or the transport 164 sending amessage to transport 162 (directly or via the server 146) indicating adesire to pass. When the event is triggered, the server 146 sends resultdata 194 to the transport of the event (such as transport 164). Theinformation sent is comprised of one or more of: action (a reason suchas another car is disallowing a lane change), location (a position suchas the transport on a right-hand side is in the way), time (a periodsuch as when a maneuver into a lane will be permissible (e.g. 13seconds)).

The time is determined by one or more of the first transport 162 and aserver 146 wherein the traffic in the lanes proximate to the firsttransport 162 and traffic ahead of the first transport 162 (such astransport 168 and other transports, not depicted) are analyzed tocalculate an approximate amount until a maneuver into the next rightlane is permitted. For example, if the first transport 162 and/or theserver 146 determine that there is traffic ahead, this may also beincluded in the alert to help the transport 164 understand when passingwill be permitted and when passing will not be permitted, and anapproximate amount of time (as determined by the instant application 150executing on the server 146 and/or one or more of the transports and/orone or more wireless devices in the transports) until the firsttransport 162 is able to maneuver to another lane to provide a passingopportunity. The result data 194 may include other information such asexpected action, expected result, related audio/video/image(s), etc.

In another embodiment, the speeds of the transports in the first lane171 are taken into account, before a recommendation is made for thefirst transport 162 to maneuver into a second lane 173. A recommendationwill be made when the speed of the second transport 164 (which has beentraveling at a higher speed that the first transport 162 beforemaneuvering behind the first transport 162) and the transport ahead ofthe first transport (such as transport 168) is traveling at or near thespeed of the second transport 164 at a distance, such as distance 160(see FIG. 1G). This recommendation is based on at least 2 reasons: 1) Itmay not be efficient for the first transport 162 to maneuver intoanother lane if the traffic ahead is traveling at a slower speed or ifthe traffic ahead is stopped (or near-stopped). The second transport 164would pass, only to be held up again by the traffic ahead in the lane,and 2) If the second transport 164 is traveling at a high speed, and thefirst transport 162 maneuvers into another lane to allow passing, thesecond transport 164 may be put into a dangerous situation, not beingable to see a transport ahead, such as transport 168, which is travelingslower. The second transport 164 may have to apply brakes, or worse, beput into a dangerous situation.

In another embodiment, the instant application executing fully orpartially in the first transport 162 traveling in a first lane 171determines a current speed of transports traveling in a second lane 173,such as transport 166. This may be determined by sensors, cameras, orthe like on transport 162. When none of the transports traveling in thesecond land 173 are moving at or near the speed of the first transport162 at a second distance 163 (FIG. 1G), the first transport 162maneuvers into the second lane 173.

In a further embodiment, if the speed of the other transports is abovethe speed of the first transport 162 at a third distance in the secondlane 173, maneuvering to the second lane 173 is not recommended for thefirst transport 162.

In yet a further embodiment, no transports behind transport 166 in thesecond lane 173 and behind the first transport 162 in the first lane 171should be above the speed of the first transport 162 in the first lane171 at a fourth distance (not depicted). For example, transport 162 istraveling at a speed of 70 mph in the first lane 171 with no othertransports beside in the second lane 173, it would be seemingly possibleto maneuver into the second lane 173. Yet, there exists anothertransport 20 yards behind the first transport 162 in the second lane 173traveling at 80 mph, therefore it is incorrect to instruct the firsttransport 162 to move into the second lane 173.

Based on this example, the instant application has determined thefollowing: speed of transport 162 in the first lane: 70 mph, speed ofanother transport in the second lane: 80 mph, distance between thetransport 162 and the other transport: 30 yards.

The amount of time to safely maneuver into the second lane may then becalculated as follows:

The delta speed between the two transports is 10 mph (70 mph and 80mph). The delta distance is 30 yards. Therefore, using the equation timeequals distance divided by speed, the following calculation is used todetermine when the two transports will be side-by-side:Convert Speed: 10 miles/hour=14.6 feet per secondTime=Distance/SpeedTime=30 yards/14.6 feet per secondTime=90 feet/14.6 feet per secondTime=6.16 seconds

Therefore, the other transport will have caught up to transport 162 inapproximately 6 seconds. Three more seconds are added until transport162 will be able to safely maneuver into the second lane 173 to give theother transport time to provide a safe distance ahead. Therefore, thealert can include: “In 9 seconds, it should be safe to maneuver into thesecond lane”. After the 9 seconds and before any maneuvering occurs, theinstant application will perform the same determination to take currenttraffic into account, and it's always changing environment.

In another embodiment, transport 162, may stay in the right-lane 173,even though notifications indicate that the transport should move intoanother lane to allow a transport behind 164 to pass.

In yet another embodiment, transport 164 is traveling in the second land173. The server 146 sends a notification to transport 162 to maintainits current position and/or slow its speed. Transport 164 then is ableto merge into the first lane 171 as long as the first distance 160 (seeFIG. 1G) is not exceeded.

A smart contract of a blockchain network is executed, in one embodiment,to perform the validation required before instructing the firsttransport 162 to maneuver into an alternate lane (e.g. lane 173). Thesmart contract validates the first transport 162, the second transport166, the other transports ahead of the first transport 168, the othertransports behind the first transport 164, the speed of the firsttransport 162, the speed of the second transport 166, the first distance160 (FIG. 1G), the second distance 163 (FIG. 1G), and the third distance165 (FIG. 1G), wherein one or more of the first transport 162, thesecond transport 164, and other transports belong to the blockchainnetwork.

In an alternate embodiment, the smart contract can also include thespeed of the other transports ahead and behind the first transport 162and the second transport 164.

In an alternate embodiment, consensus must be obtained by the systembefore instructing the first transport 162 to maneuver into another lane(e.g. lane 173). The consensus is sought by transports that proximate tothe first transport, such as the second transport 166, the othertransports ahead of the first transport 168, and other transports behindthe first transport (e.g. transport 170). For example, a computer of thetransport may connect to other transports and acquire consensus forvalidation of the distance between the transports. All of the transportsmay serve as dynamic blockchain peers such that communication betweenthe transports is implemented over a blockchain network. Thedetermination of safety level for transport's maneuvers may beimplemented by execution of a smart contract.

In yet a further embodiment, if the transport 162 does not comply (forexample, speeds up to prohibit transport 164 from merging), the server146 can note this action (or inaction) and maneuver other transportsaccordingly. For example, if transport 160 (FIG. 1G) is much furtherbehind and traveling at a faster speed than transport 162 (and transport164 is no longer in the second lane 173), the server 146 may send anotification to transport 170 to maneuver to the second lane 173 and/orto the third lane 175 well in advance of being in proximity to thetransport 162 in order to more efficiently manage navigation of thetransport 160 (and other transports on the road) and to avoid apotentially dangerous situation.

In other embodiments, the system 140 can determine that a transport in aparticular lane is traveling at a higher speed than that lane canaccommodate. For example, the lane may have a certain number of vehiclestraveling at a lower speed and causing a traffic buildup. The system maydetermine that switching lanes is not a possibility (because the lanemay be occupied by one or more other transports, etc.). In such asituation, the system may determine that a safer action would be toadvise the transport to maneuver away from the heavily trafficked lane(for example, to a shoulder on a highway, to a parking lot or otherstreet on a roadway, etc.).

In a further embodiment the system 140 may advise the transport todeaccelerate before, during, and/or after the instruction(s) to maneuveraway from the problematic lane. The system will also advise thetransport to come to a complete stop at any juncture based on thetraffic conditions, may provide a notification to turn on hazard lightsor other safety indicators, or may directly do so by accessing one ormore systems/sensors on the transport as described herein. When thesystem determines it is safe to maneuver back to a lane and continue totravel, the system will indicate an appropriate time to do so bycommunicating with the transport and/or a device associated with thetransport as described herein.

FIG. 1J illustrates a network diagram for insuring proper lanemanagement. Referring to FIG. 1J, the network diagram 195 includes atransport node 105 (e.g., a vehicle) connected to other transport nodes105 over a blockchain network 106 that has a ledger 108 for storingsafety-related information and transactions 110. The transport nodes 102and 105 may serve as blockchain 106 peers. While this example describesin detail only one transport node 102, multiple such nodes may beconnected to the blockchain 106. It should be understood that thetransport node 102 may include additional components and that some ofthe components described herein may be removed and/or modified withoutdeparting from a scope of the transport node 102 disclosed herein. Thetransport node 102 may have a computing device or a server computer, orthe like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the transportnode 102 may include multiple processors, multiple cores, or the like,without departing from the scope of the transport node 102.

The transport node 102 may also include a non-transitory computerreadable medium 102A that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 196A-196E and are furtherdiscussed below. Examples of the non-transitory computer readable medium102A may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 102A may be aRandom Access memory (RAM), an Electrically Erasable ProgrammableRead-Only Memory (EEPROM), a hard disk, an optical disc, or other typeof storage device.

The processor 104 may execute the machine-readable instructions196A-196E to maneuver the transport in an alternate lane whereinconsensus is obtained from multiple transports in proximity, eachtransport being a transport node 105. The blockchain 106 may beconfigured to use one or more smart contracts that manage transactionsfor multiple participating nodes 102 and 105. The transport node 102 mayprovide safety-related information to the blockchain 106 and thistransaction may be stored on the ledger 108.

The processor 104 may execute the machine-readable instructions 196B todetermine that a speed of a second transport is greater than a speed ofthe first transport, such as the situation when the second transport isbehind the first transport. The processor 104 may execute themachine-readable instructions 196C to determine that no other transportare ahead of the first transport by a first distance and beside thefirst transport by a second distance. The processor 104 may execute themachine-readable instructions 196D to maneuver the transport to a secondlane to pass the first transport in the first lane. The processor 104may execute the machine-readable instructions 196E to maneuver thetransport to the first lane when there are no other transports travelingin the first lane at a third distance behind the first transport and ator near the speed of the second transport.

FIG. 1K illustrates a network diagram for diagnosing issues on atransport. Referring to FIG. 1K, the network diagram 197 includes atransport node 102 (e.g., a vehicle) connected to other transport nodes105 over a blockchain network 106 that has a ledger 108 for storingsafety-related information and transactions 110. The transport nodes 102and 105 may serve as blockchain 106 peers. While this example describesin detail only one transport node 102, multiple such nodes may beconnected to the blockchain 106. It should be understood that thetransport node 102 may include additional components and that some ofthe components described herein may be removed and/or modified withoutdeparting from a scope of the transport node 102 disclosed herein. Thetransport node 102 may have a computing device or a server computer, orthe like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the transportnode 102 may include multiple processors, multiple cores, or the like,without departing from the scope of the transport node 102.

The transport node 102 may also include a non-transitory computerreadable medium 102B that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 197A-197E and are furtherdiscussed below. Examples of the non-transitory computer readable medium102B may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 102B may be aRandom Access memory (RAM), an Electrically Erasable ProgrammableRead-Only Memory (EEPROM), a hard disk, an optical disc, or other typeof storage device.

The processor 104 may execute the machine-readable instructions 197A toobtain a first data including one or more of at least one first videoand at least one first image of a moving transport. The blockchain 106may be configured to use one or more smart contracts that managetransactions for multiple participating nodes 102 and 105. The transportnode 102 may provide the at least one first video to the blockchain 106and this transaction may be stored on the ledger 108.

The processor 104 may execute the machine-readable instructions 197B toanalyze the first data to determine an initial issue. The processor 104may execute the machine-readable instruction 197C to query a server fora second data based on the analyzing, wherein the second data is one ormore of at least one second video and at least one second image of themoving transport at a previous time. The processor 104 may execute themachine-readable instruction 197D to determine a verified issue existswhen there is a delta between the first data and the second data. Theprocessor 104 may execute the machine-readable instruction 197E to sendthe verified issue to a server.

FIG. 2A illustrates a blockchain architecture configuration 200,according to example embodiments. Referring to FIG. 2A, the blockchainarchitecture 200 may include certain blockchain elements, for example, agroup of blockchain member nodes 202-206 as part of a blockchain group210. In one example embodiment, a permissioned blockchain is notaccessible to all parties but only to those members with permissionedaccess to the blockchain data. The blockchain nodes participate in anumber of activities, such as blockchain entry addition and validationprocess (consensus). One or more of the blockchain nodes may endorseentries based on an endorsement policy and may provide an orderingservice for all blockchain nodes. A blockchain node may initiate ablockchain action (such as an authentication) and seek to write to ablockchain immutable ledger stored in the blockchain, a copy of whichmay also be stored on the underpinning physical infrastructure.

The blockchain transactions 220 are stored in memory of computers as thetransactions are received and approved by the consensus model dictatedby the members' nodes. Approved transactions 226 are stored in currentblocks of the blockchain and committed to the blockchain via a committalprocedure, which includes performing a hash of the data contents of thetransactions in a current block and referencing a previous hash of aprevious block. Within the blockchain, one or more smart contracts 230may exist that define the terms of transaction agreements and actionsincluded in smart contract executable application code 232, such asregistered recipients, vehicle features, requirements, permissions,sensor thresholds, etc. The code may be configured to identify whetherrequesting entities are registered to receive vehicle services, whatservice features they are entitled/required to receive given theirprofile statuses and whether to monitor their actions in subsequentevents. For example, when a service event occurs and a user is riding inthe vehicle, the sensor data monitoring may be triggered, and a certainparameter, such as a vehicle charge level, may be identified as beingabove/below a particular threshold for a particular period of time. Thenthe result may be a change to a current status, which requires an alertto be sent to the managing party (i.e., vehicle owner, vehicle operator,server, etc.) so the service can be identified and stored for reference.The vehicle sensor data collected may be based on types of sensor dataused to collect information about vehicle's status. The sensor data mayalso be the basis for the vehicle event data 234, such as a location(s)to be traveled, an average speed, a top speed, acceleration rates,whether there were any collisions, was the expected route taken, what isthe next destination, whether safety measures are in place, whether thevehicle has enough charge/fuel, etc. All such information may be thebasis of smart contract terms 230, which are then stored in ablockchain. For example, sensor thresholds stored in the smart contractcan be used as the basis for whether a detected service is necessary andwhen and where the service should be performed.

FIG. 2B illustrates a shared ledger configuration, according to exampleembodiments. Referring to FIG. 2B, the blockchain logic example 250includes a blockchain application interface 252 as an API or plug-inapplication that links to the computing device and execution platformfor a particular transaction. The blockchain configuration 250 mayinclude one or more applications which are linked to applicationprogramming interfaces (APIs) to access and execute storedprogram/application code (e.g., smart contract executable code, smartcontracts, etc.) which can be created according to a customizedconfiguration sought by participants and can maintain their own state,control their own assets, and receive external information. This can bedeployed as an entry and installed, via appending to the distributedledger, on all blockchain nodes.

The smart contract application code 254 provides a basis for theblockchain transactions by establishing application code which whenexecuted causes the transaction terms and conditions to become active.The smart contract 230, when executed, causes certain approvedtransactions 226 to be generated, which are then forwarded to theblockchain platform 262. The platform includes a security/authorization268, computing devices, which execute the transaction management 266 anda storage portion 264 as a memory that stores transactions and smartcontracts in the blockchain.

The blockchain platform may include various layers of blockchain data,services (e.g., cryptographic trust services, virtual executionenvironment, etc.), and underpinning physical computer infrastructurethat may be used to receive and store new entries and provide access toauditors which are seeking to access data entries. The blockchain mayexpose an interface that provides access to the virtual executionenvironment necessary to process the program code and engage thephysical infrastructure. Cryptographic trust services may be used toverify entries such as asset exchange entries and keep informationprivate.

The blockchain architecture configuration of FIGS. 2A and 2B may processand execute program/application code via one or more interfaces exposed,and services provided, by the blockchain platform. As a non-limitingexample, smart contracts may be created to execute reminders, updates,and/or other notifications subject to the changes, updates, etc. Thesmart contracts can themselves be used to identify rules associated withauthorization and access requirements and usage of the ledger. Forexample, the information may include a new entry, which may be processedby one or more processing entities (e.g., processors, virtual machines,etc.) included in the blockchain layer. The result may include adecision to reject or approve the new entry based on the criteriadefined in the smart contract and/or a consensus of the peers. Thephysical infrastructure may be utilized to retrieve any of the data orinformation described herein.

Within smart contract executable code, a smart contract may be createdvia a high-level application and programming language, and then writtento a block in the blockchain. The smart contract may include executablecode, which is registered, stored, and/or replicated with a blockchain(e.g., distributed network of blockchain peers). An entry is anexecution of the smart contract code, which can be performed in responseto conditions associated with the smart contract being satisfied. Theexecuting of the smart contract may trigger a trusted modification(s) toa state of a digital blockchain ledger. The modification(s) to theblockchain ledger caused by the smart contract execution may beautomatically replicated throughout the distributed network ofblockchain peers through one or more consensus protocols.

The smart contract may write data to the blockchain in the format ofkey-value pairs. Furthermore, the smart contract code can read thevalues stored in a blockchain and use them in application operations.The smart contract code can write the output of various logic operationsinto the blockchain. The code may be used to create a temporary datastructure in a virtual machine or other computing platform. Data writtento the blockchain can be public and/or can be encrypted and maintainedas private. The temporary data that is used/generated by the smartcontract is held in memory by the supplied execution environment, thendeleted once the data needed for the blockchain is identified.

A smart contract executable code may include the code interpretation ofa smart contract, with additional features. As described herein, thesmart contract executable code may be program code deployed on acomputing network, where it is executed and validated by chainvalidators together during a consensus process. The smart contractexecutable code receives a hash and retrieves from the blockchain a hashassociated with the data template created by use of a previously storedfeature extractor. If the hashes of the hash identifier and the hashcreated from the stored identifier template data match, then the smartcontract executable code sends an authorization key to the requestedservice. The smart contract executable code may write to the blockchaindata associated with the cryptographic details.

FIG. 2C illustrates a blockchain configuration for storing blockchaintransaction data, according to example embodiments. Referring to FIG.2C, the example configuration 270 provides for the vehicle 272, the userdevice 274 and a server 276 sharing information with a distributedledger (i.e., blockchain) 278. The server may represent a serviceprovider entity inquiring with a vehicle service provider to share userprofile rating information in the event that a known and establisheduser profile is attempting to rent a vehicle with an established ratedprofile. The server 276 may be receiving and processing data related toa vehicle's service requirements. As the service events occur, such asthe vehicle sensor data indicates a need for fuel/charge, a maintenanceservice, etc., a smart contract may be used to invoke rules, thresholds,sensor information gathering, etc., which may be used to invoke thevehicle service event. The blockchain transaction data 280 is saved foreach transaction, such as the access event, the subsequent updates to avehicle's service status, event updates, etc. The transactions mayinclude the parties, the requirements (e.g., 18 years of age, serviceeligible candidate, valid driver's license, etc.), compensation levels,the distance traveled during the event, the registered recipientspermitted to access the event and host a vehicle service,rights/permissions, sensor data retrieved during the vehicle eventoperation to log details of the next service event and identify avehicle's condition status, and thresholds used to make determinationsabout whether the service event was completed and whether the vehicle'scondition status has changed.

FIG. 3A illustrates a flow diagram 300, according to exampleembodiments. Referring to FIG. 3A, an example method may be executed bythe transport node 102 (see FIG. 1B). It should be understood thatmethod 300 depicted in FIG. 3A may include additional operations andthat some of the operations described therein may be removed and/ormodified without departing from the scope of the method 300. Thedescription of the method 300 is also made with reference to thefeatures depicted in FIG. 1B for purposes of illustration. Particularly,the processor 104 of the transport node 102 may execute some or all ofthe operations included in the method 300.

With reference to FIG. 3A, at block 302, the processor 104 may detect anexit on a road. At block 304, the processor 104 may calculate aprobability that the transport is not prepared to exit. At block 306,the processor 104 may request at least one other transport proximate tothe transport to alter its speed if the probability exceeds a threshold.At block 308, the processor 104 may, responsive to a detecting of analtering of the speed by the at least one other transport, trigger thetransport to exit the road.

FIG. 3B illustrates a flow diagram 320 of an example method, accordingto example embodiments. Referring to FIG. 3B, the method 320 may alsoinclude one or more of the following steps. At block 322, the processor104 may calculate the probability based on a speed of the transport anda distance to the exit. At block 324, the processor 104 may calculatethe probability based on a lane the transport is in. At block 326, theprocessor 104 may acquire a current distance to the exit and to reducethe transport speed based on the current distance. At block 328, theprocessor 104 may receive an agreement from the at least one othertransport to alter its speed. Note that the agreement may constitute aconsensus of a blockchain the transport and the at least one othertransport belong to. At block 329, the processor 104 may execute a smartcontract to calculate the probability that the transport is not preparedto exit.

FIG. 3C illustrates a flow diagram 330, according to exampleembodiments. Referring to FIG. 3C, an example method may be executed bythe transport node 102 (see FIG. 1C). It should be understood thatmethod 330 depicted in FIG. 3C may include additional operations andthat some of the operations described therein may be removed and/ormodified without departing from the scope of the method 330. Thedescription of the method 330 is also made with reference to thefeatures depicted in FIG. 1C for purposes of illustration. Particularly,the processor 104 of the transport node 102 may execute some or all ofthe operations included in the method 330.

With reference to FIG. 3C, at block 333, the processor 104 may detect anintention to prepare to take an exit. At block 335, the processor 104may acquire distance and speed measurements. At block 337, the processor104 may calculate a probability of a safe exit by the transport based onthe measurements. At block 339, the processor 104 may in response to theprobability being below a threshold, request at least one transport froma plurality of the transports proximate to the transport to perform amaneuver to allow for the safe exit of the transport.

FIG. 3D illustrates a flow diagram 340 of an example method, accordingto example embodiments. Referring to FIG. 3D, the method 340 may alsoinclude one or more of the following steps. At block 342, the processor104 may responsive to a detecting of an altering of the speed by the atleast one transport from the plurality of the transports, inform a userof the transport to proceed to exit. At block 344, the processor 104 maycalculate the probability of the safe exit based on a speed of the atleast one transport from a plurality of the transports proximate to thetransport. At block 346, the processor 104 may calculate the probabilityof the safe exit based on a lane the transport is in. At block 348, theprocessor 104 may receive an agreement from the at least one transportfrom a plurality of the transports proximate to the transport to alterits speed. Note that the agreements may constitute a consensus of ablockchain. At block 350, the processor 104 may execute a smart contractto calculate the probability of the safe exit by the transport based onthe measurements.

FIG. 3E illustrates a flow diagram 360, according to exampleembodiments. Referring to FIG. 3E, an example method may be executed bythe transport node 102 (see FIG. 1D). It should be understood thatmethod 360 depicted in FIG. 3E may include additional operations andthat some of the operations described therein may be removed and/ormodified without departing from the scope of the method 360. Thedescription of the method 360 is also made with reference to thefeatures depicted in FIG. 1D for purposes of illustration. Particularly,the processor 104 of the transport node 102 may execute some or all ofthe operations included in the method 360.

With reference to FIG. 3E, at block 362, the processor 104 may send arequest to perform a maneuver to a plurality of transports in a caravan.At block 364, the processor 104 may receive agreements from theplurality of the transports. At block 366, the processor 104 mayresponsive to the agreements, acquire speed and distance measurements ofthe caravan. At block 368, the processor 104 may analyze themeasurements to determine a safety level of the maneuver. At block 370,the processor 104 may send a command to perform the maneuver to theplurality of the transports in the caravan, if the safety level exceedsa threshold.

FIG. 3F illustrates a flow diagram 380 of an example method, accordingto example embodiments. Referring to FIG. 3F, the method 380 may alsoinclude one or more of the following steps. At block 382, the processor104 may send a command to the plurality of the transports in the caravanto reduce speed, is the safety level is below the threshold. At block384, the processor 104 may acquire new measurements based on a reducedspeed. At block 386, the processor 104 may determine the safety level ofthe maneuver based on the new measurements. At block 388, the processor104 may send a command to perform the maneuver to the plurality of thetransports in the caravan, upon the safety level exceeding or equaling athreshold. Note that the agreements may constitute a consensus on ablockchain the plurality of the transports in the caravan belong to. Atblock 389, the processor 104 may execute a smart contract to analyze themeasurements to determine the safety level of the maneuver.

FIG. 3G illustrates a flow diagram 390, according to exampleembodiments. Referring to FIG. 3G, an example method may be executed bythe transport node 102 (see FIG. 1F). It should be understood thatmethod 390 depicted in FIG. 3G may include additional operations andthat some of the operations described therein may be removed and/ormodified without departing from the scope of the method 390. Thedescription of the method 390 is also made with reference to thefeatures depicted in FIG. 1F for purposes of illustration. Particularly,the processor 104 of the transport node 102 may execute some or all ofthe operations included in the method 390.

With reference to FIG. 3G, at block 391, the processor 104 may acquire aplurality of measurements of a caravan comprising a plurality oftransports. At block 393, the processor 104 may analyze the measurementsbased on information received from an external source. At block 395, theprocessor 104 may determine a safety level of the caravan based on theanalysis. At block 397, the processor 104 may send a command to adjusttravel parameters to a plurality of transports in a caravan in responseto the safety level being below a threshold.

FIG. 3H illustrates a flow diagram 394 of an example method, accordingto example embodiments. Referring to FIG. 3H, the method 394 may alsoinclude one or more of the following steps. At block 401, the processor104 may send a command to the plurality of the transports in the caravanto adjust speed. At block 403, the processor 104 may send a command tothe plurality of the transports in the caravan to adjust a distancebetween the transports. At block 405, the processor 104 may determinethe safety level of the caravan based on the adjusted travel parameters.At block 407, the processor 104 may send a command to further adjust thetravel parameters of the plurality of the transports in the caravan, ifthe safety level of the caravan remains below the threshold. Note thatthe adjustment of the travel parameters may constitute a consensus on ablockchain the plurality of the transports in the caravan belong to. Atblock 409, the processor 104 may execute a smart contract to determinethe safety level of the caravan based on the adjustment of the travelparameters.

FIG. 3I illustrates a flow diagram 392 of an example method, accordingto example embodiments. Referring to FIG. 3I, a first transport istraveling in a first lane 392A. A processor of the first transportdetermines that a speed of a second transport is greater than a speed ofthe first transport when the second transport is behind the firsttransport 392B. The first transport determines that no other transportsare ahead of the first transport by a first distance in the first laneand beside the first transport by a second distance in a second lane392C. The first transport maneuvers to the second lane allowing thesecond transport to pass the first transport in the first lane 392D. Thefirst transport maneuvers to the first lane when there are no othertransports traveling in the first lane at a third distance behind thefirst transport and at or near the speed of the second transport 392E.

FIG. 3J illustrates a flow diagram 396 of an example method, accordingto example embodiments. Referring to FIG. 3J, the method 396 may alsoinclude one or more of the following steps. At block 396A, the processor104 may send a command to obtain a first data including one or more ofat least one first video and at least one first image of a movingtransport. At block 396B, the processor 104 may send a command toanalyze the first data to determine an initial issue. At block 396C, theprocessor 104 may send a command to query a server for a second databased on the analyzing, wherein the second data is one or more of atleast one second video and at least one second image of the movingtransport at a previous time. At block 396D, the processor 104 may senda command to determine a verified issue exists when there is a deltabetween the first data and the second data. At block 396E, the processor104 may send a command to send the verified issue to a server.

FIG. 4A illustrates an example blockchain vehicle configuration 400 formanaging blockchain transactions associated with a vehicle, according toexample embodiments. Referring to FIG. 4A, as a particulartransport/vehicle 425 is engaged in transactions, such as asset transfertransactions (e.g., access key exchanges, vehicle service, dealertransactions, delivery/pickup, transportation services, etc.). Thevehicle 425 may receive assets 410 and/or expel/transfer assets 412according to a transaction(s) defined by smart contracts. Thetransaction module 420 may record information, such as parties, credits,service descriptions, date, time, location, results, notifications,unexpected events, etc. Those transactions in the transaction module 420may be replicated into a blockchain 430, which may be managed by aremote server and/or by a remote blockchain peers, among which thevehicle 425 itself may represent a blockchain member and/or blockchainpeer. In other embodiments, the blockchain 430 resides on the vehicle425. The assets received and/or transferred can be based on location andconsensus as described herein.

FIG. 4B illustrates an example blockchain vehicle configuration 440 formanaging blockchain transactions between a service node (e.g., a gasstation, a service center, a body shop, a rental center, automotivedealer, local service stop, delivery pickup center, etc.) and a vehicle,according to example embodiments. In this example, the vehicle 425 mayhave driven itself to a service node 442, because the vehicle needsservice and/or needs to stop at a particular location. The service node442 may perform a service (e.g., pump gas) or may register the vehicle425 for a service call at a particular time, with a particular strategy,such as oil change, battery charge or replacement, tire change orreplacement, and any other transport related service. The servicesrendered 444 may be performed based on a smart contract, which isdownloaded from or accessed via the blockchain 430 and identified forpermission to perform such services for a particular rate of exchange.The services may be logged in the transaction log of the transactionmodule 420, the credits 412 are transferred to the service center 442and the blockchain may log transactions to represent all the informationregarding the recent service. In other embodiments, the blockchain 430resides on the vehicle 425 and/or the service center server. In oneexample, a transport event may require a refuel or other vehicle serviceand the occupants may then be responsible for the asset value increasefor such service. The service may be rendered via a blockchainnotification, which is then used to redistribute the asset value to theoccupants via their respective asset values. Responsibility for theservice center activities can be based on asset transfer as describedherein.

FIG. 4C illustrates an example blockchain vehicle configuration 450 formanaging blockchain transactions conducted among various vehicles,according to the exemplary embodiments. The vehicle 425 may engage withanother vehicle 408 to perform various actions such as to share accesskeys, transfer keys, acquire service calls, etc. when the vehicle hasreached a status where the assets need to be shared with anothervehicle. For example, the vehicle 408 may be due for a battery chargeand/or may have an issue with a tire and may be in route to pick up apackage for delivery. The vehicle 408 may notify another vehicle 425which is in its network and which operates on its blockchain memberservice. The vehicle 425 may then receive the information via a wirelesscommunication request to perform the package pickup from the vehicle 408and/or from a server (not shown). The transactions are logged in thetransaction modules 452 and 420 of both vehicles. The assets aretransferred from vehicle 408 to vehicle 425 and the record of the assettransfer is logged in the blockchain 430/454 assuming that theblockchains are different from one another, or, are logged in the sameblockchain used by all members. Responsibility for the transferredassets can be based on asset values (e.g., access keys) as describedherein.

FIG. 5 illustrates blockchain blocks 500 that can be added to adistributed ledger, according to example embodiments, and contents ofblock structures 502A to 502 n. Referring to FIG. 5, clients (not shown)may submit entries to blockchain nodes to enact activity on theblockchain. As an example, clients may be applications that act onbehalf of a requester, such as a device, person or entity to proposeentries for the blockchain. The plurality of blockchain peers (e.g.,blockchain nodes) may maintain a state of the blockchain network and acopy of the distributed ledger. Different types of blockchainnodes/peers may be present in the blockchain network including endorsingpeers, which simulate and endorse entries proposed by clients andcommitting peers which verify endorsements, validate entries, and commitentries to the distributed ledger. In this example, the blockchain nodesmay perform the role of endorser node, committer node, or both.

The instant system includes a blockchain which stores immutable,sequenced records in blocks, and a state database (current world state)maintaining a current state of the blockchain. One distributed ledgermay exist per channel and each peer maintains its own copy of thedistributed ledger for each channel of which they are a member. Theinstant blockchain is an entry log, structured as hash-linked blockswhere each block contains a sequence of N entries. Blocks may includevarious components such as those shown in FIG. 5. The linking of theblocks may be generated by adding a hash of a prior block's headerwithin a block header of a current block. In this way, all entries onthe blockchain are sequenced and cryptographically linked togetherpreventing tampering with blockchain data without breaking the hashlinks. Furthermore, because of the links, the latest block in theblockchain represents every entry that has come before it. The instantblockchain may be stored on a peer file system (local or attachedstorage), which supports an append-only blockchain workload.

The current state of the blockchain and the distributed ledger may bestored in the state database. Here, the current state data representsthe latest values for all keys ever included in the chain entry log ofthe blockchain. Smart contract executable code invocations executeentries against the current state in the state database. To make thesesmart contract executable code interactions extremely efficient, thelatest values of all keys are stored in the state database. The statedatabase may include an indexed view into the entry log of theblockchain, it can therefore be regenerated from the chain at any time.The state database may automatically get recovered (or generated ifneeded) upon peer startup, before entries are accepted.

Endorsing nodes receive entries from clients and endorse the entry basedon simulated results. Endorsing nodes hold smart contracts whichsimulate the entry proposals. When an endorsing node endorses an entry,the endorsing nodes creates an entry endorsement which is a signedresponse from the endorsing node to the client application indicatingthe endorsement of the simulated entry. The method of endorsing an entrydepends on an endorsement policy which may be specified within smartcontract executable code. An example of an endorsement policy is “themajority of endorsing peers must endorse the entry.” Different channelsmay have different endorsement policies. Endorsed entries are forward bythe client application to an ordering service.

The ordering service accepts endorsed entries, orders them into a block,and delivers the blocks to the committing peers. For example, theordering service may initiate a new block when a threshold of entrieshas been reached, a timer times out, or another condition. In thisexample, blockchain node is a committing peer that has received a datablock 602A for storage on the blockchain. The ordering service may bemade up of a cluster of orderers. The ordering service does not processentries, smart contracts, or maintain the shared ledger. Rather, theordering service may accept the endorsed entries and specifies the orderin which those entries are committed to the distributed ledger. Thearchitecture of the blockchain network may be designed such that thespecific implementation of ‘ordering’ (e.g., Solo, Kafka, BFT, etc.)becomes a pluggable component.

Entries are written to the distributed ledger in a consistent order. Theorder of entries is established to ensure that the updates to the statedatabase are valid when they are committed to the network. Unlike acrypto-currency blockchain system (e.g., Bitcoin, etc.) where orderingoccurs through the solving of a cryptographic puzzle, or mining, in thisexample the parties of the distributed ledger may choose the orderingmechanism that best suits that network.

Referring to FIG. 5, a block 502A (also referred to as a data block)that is stored on the blockchain and/or the distributed ledger mayinclude multiple data segments such as a block header 504A to 504 n,transaction specific data 506A to 506 n, and block metadata 508A to 508n. It should be appreciated that the various depicted blocks and theircontents, such as block 502A and its contents are merely for purposes ofan example and are not meant to limit the scope of the exampleembodiments. In some cases, both the block header 504A and the blockmetadata 508A may be smaller than the transaction specific data 506Awhich stores entry data; however, this is not a requirement. The block502A may store transactional information of N entries (e.g., 100, 500,1000, 2000, 3000, etc.) within the block data 510A to 510 n. The block502A may also include a link to a previous block (e.g., on theblockchain) within the block header 504A. In particular, the blockheader 504A may include a hash of a previous block's header. The blockheader 504A may also include a unique block number, a hash of the blockdata 510A of the current block 502A, and the like. The block number ofthe block 502A may be unique and assigned in an incremental/sequentialorder starting from zero. The first block in the blockchain may bereferred to as a genesis block which includes information about theblockchain, its members, the data stored therein, etc.

The block data 510A may store entry information of each entry that isrecorded within the block. For example, the entry data may include oneor more of a type of the entry, a version, a timestamp, a channel ID ofthe distributed ledger, an entry ID, an epoch, a payload visibility, asmart contract executable code path (deploy tx), a smart contractexecutable code name, a smart contract executable code version, input(smart contract executable code and functions), a client (creator)identify such as a public key and certificate, a signature of theclient, identities of endorsers, endorser signatures, a proposal hash,smart contract executable code events, response status, namespace, aread set (list of key and version read by the entry, etc.), a write set(list of key and value, etc.), a start key, an end key, a list of keys,a Merkel tree query summary, and the like. The entry data may be storedfor each of the N entries.

In some embodiments, the block data 510A may also store transactionspecific data 506A which adds additional information to the hash-linkedchain of blocks in the blockchain. Accordingly, the data 506A can bestored in an immutable log of blocks on the distributed ledger. Some ofthe benefits of storing such data 506A are reflected in the variousembodiments disclosed and depicted herein. The block metadata 508A maystore multiple fields of metadata (e.g., as a byte array, etc.).Metadata fields may include signature on block creation, a reference toa last configuration block, an entry filter identifying valid andinvalid entries within the block, last offset persisted of an orderingservice that ordered the block, and the like. The signature, the lastconfiguration block, and the orderer metadata may be added by theordering service. Meanwhile, a committer of the block (such as ablockchain node) may add validity/invalidity information based on anendorsement policy, verification of read/write sets, and the like. Theentry filter may include a byte array of a size equal to the number ofentries in the block data 510A and a validation code identifying whetheran entry was valid/invalid.

The other blocks 502B to 502 n in the blockchain also have headers,files, and values. However, unlike the first block 502A, each of theheaders 504A to 504 n in the other blocks includes the hash value of animmediately preceding block. The hash value of the immediately precedingblock may be just the hash of the header of the previous block or may bethe hash value of the entire previous block. By including the hash valueof a preceding block in each of the remaining blocks, a trace can beperformed from the Nth block back to the genesis block (and theassociated original file) on a block-by-block basis, as indicated byarrows 512, to establish an auditable and immutable chain-of-custody.

The above embodiments may be implemented in hardware, in a computerprogram executed by a processor, in firmware, or in a combination of theabove. A computer program may be embodied on a computer readable medium,such as a storage medium. For example, a computer program may reside inrandom access memory (“RAM”), flash memory, read-only memory (“ROM”),erasable programmable read-only memory (“EPROM”), electrically erasableprogrammable read-only memory (“EEPROM”), registers, hard disk, aremovable disk, a compact disk read-only memory (“CD-ROM”), or any otherform of storage medium known in the art.

An exemplary storage medium may be coupled to the processor such thatthe processor may read information from, and write information to, thestorage medium. In the alternative, the storage medium may be integralto the processor. The processor and the storage medium may reside in anapplication specific integrated circuit (“ASIC”). In the alternative,the processor and the storage medium may reside as discrete components.For example, FIG. 6 illustrates an example computer system architecture600, which may represent or be integrated in any of the above-describedcomponents, etc.

FIG. 6 is not intended to suggest any limitation as to the scope of useor functionality of embodiments of the application described herein.Regardless, the computing node 600 is capable of being implementedand/or performing any of the functionality set forth hereinabove.

In computing node 600 there is a computer system/server 602, which isoperational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing systems, environments, and/or configurations that may besuitable for use with computer system/server 602 include, but are notlimited to, personal computer systems, server computer systems, thinclients, thick clients, hand-held or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices, and the like.

Computer system/server 602 may be described in the general context ofcomputer system-executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 602 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 6, computer system/server 602 in cloud computing node600 is shown in the form of a general-purpose computing device. Thecomponents of computer system/server 602 may include, but are notlimited to, one or more processors or processing units 604, a systemmemory 606, and a bus that couples various system components includingsystem memory 606 to processor 604.

The bus represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include Industry Standard Architecture(ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA)bus, Video Electronics Standards Association (VESA) local bus, andPeripheral Component Interconnects (PCI) bus.

Computer system/server 602 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 602, and it includes both volatileand non-volatile media, removable and non-removable media. System memory606, in one embodiment, implements the flow diagrams of the otherfigures. The system memory 606 can include computer system readablemedia in the form of volatile memory, such as random-access memory (RAM)608 and/or cache memory 610. Computer system/server 602 may furtherinclude other removable/non-removable, volatile/non-volatile computersystem storage media. By way of example only, memory 606 can be providedfor reading from and writing to a non-removable, non-volatile magneticmedia (not shown and typically called a “hard drive”). Although notshown, a magnetic disk drive for reading from and writing to aremovable, non-volatile magnetic disk (e.g., a “floppy disk”), and anoptical disk drive for reading from or writing to a removable,non-volatile optical disk such as a CD-ROM, DVD-ROM or other opticalmedia can be provided. In such instances, each can be connected to thebus by one or more data media interfaces. As will be further depictedand described below, memory 606 may include at least one program producthaving a set (e.g., at least one) of program modules that are configuredto carry out the functions of various embodiments of the application.

Program/utility, having a set (at least one) of program modules, may bestored in memory 606 by way of example, and not limitation, as well asan operating system, one or more application programs, other programmodules, and program data. Each of the operating system, one or moreapplication programs, other program modules, and program data or somecombination thereof, may include an implementation of a networkingenvironment. Program modules generally carry out the functions and/ormethodologies of various embodiments of the application as describedherein.

As will be appreciated by one skilled in the art, aspects of the presentapplication may be embodied as a system, method, or computer programproduct. Accordingly, aspects of the present application may take theform of an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present application may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Computer system/server 602 may also communicate with one or moreexternal devices via an I/O adapter 612, such as a keyboard, a pointingdevice, a display, etc.; one or more devices that enable a user tointeract with computer system/server 602; and/or any devices (e.g.,network card, modem, etc.) that enable computer system/server 602 tocommunicate with one or more other computing devices. Such communicationcan occur via I/O interfaces of the adapter 612. Still yet, computersystem/server 602 can communicate with one or more networks such as alocal area network (LAN), a general wide area network (WAN), and/or apublic network (e.g., the Internet) via a network adapter. As depicted,adapter 612 communicates with the other components of computersystem/server 602 via a bus. It should be understood that although notshown, other hardware and/or software components could be used inconjunction with computer system/server 602. Examples, include, but arenot limited to: microcode, device drivers, redundant processing units,external disk drive arrays, RAID systems, tape drives, and data archivalstorage systems, etc.

Although an exemplary embodiment of at least one of a system, method,and non-transitory computer readable medium has been illustrated in theaccompanied drawings and described in the foregoing detaileddescription, it will be understood that the application is not limitedto the embodiments disclosed, but is capable of numerous rearrangements,modifications, and substitutions as set forth and defined by thefollowing claims. For example, the capabilities of the system of thevarious figures can be performed by one or more of the modules orcomponents described herein or in a distributed architecture and mayinclude a transmitter, receiver or pair of both. For example, all orpart of the functionality performed by the individual modules, may beperformed by one or more of these modules. Further, the functionalitydescribed herein may be performed at various times and in relation tovarious events, internal or external to the modules or components. Also,the information sent between various modules can be sent between themodules via at least one of: a data network, the Internet, a voicenetwork, an Internet Protocol network, a wireless device, a wired deviceand/or via plurality of protocols. Also, the messages sent or receivedby any of the modules may be sent or received directly and/or via one ormore of the other modules.

One skilled in the art will appreciate that a “system” could be embodiedas a personal computer, a server, a console, a personal digitalassistant (PDA), a cell phone, a tablet computing device, a smartphoneor any other suitable computing device, or combination of devices.Presenting the above-described functions as being performed by a“system” is not intended to limit the scope of the present applicationin any way but is intended to provide one example of many embodiments.Indeed, methods, systems and apparatuses disclosed herein may beimplemented in localized and distributed forms consistent with computingtechnology.

It should be noted that some of the system features described in thisspecification have been presented as modules, in order to moreparticularly emphasize their implementation independence. For example, amodule may be implemented as a hardware circuit comprising custom verylarge-scale integration (VLSI) circuits or gate arrays, off-the-shelfsemiconductors such as logic chips, transistors, or other discretecomponents. A module may also be implemented in programmable hardwaredevices such as field programmable gate arrays, programmable arraylogic, programmable logic devices, graphics processing units, or thelike.

A module may also be at least partially implemented in software forexecution by various types of processors. An identified unit ofexecutable code may, for instance, comprise one or more physical orlogical blocks of computer instructions that may, for instance, beorganized as an object, procedure, or function. Nevertheless, theexecutables of an identified module need not be physically locatedtogether but may comprise disparate instructions stored in differentlocations which, when joined logically together, comprise the module andachieve the stated purpose for the module. Further, modules may bestored on a computer-readable medium, which may be, for instance, a harddisk drive, flash device, random access memory (RAM), tape, or any othersuch medium used to store data.

Indeed, a module of executable code could be a single instruction, ormany instructions, and may even be distributed over several differentcode segments, among different programs, and across several memorydevices. Similarly, operational data may be identified and illustratedherein within modules and may be embodied in any suitable form andorganized within any suitable type of data structure. The operationaldata may be collected as a single data set or may be distributed overdifferent locations including over different storage devices, and mayexist, at least partially, merely as electronic signals on a system ornetwork.

It will be readily understood that the components of the application, asgenerally described and illustrated in the figures herein, may bearranged and designed in a wide variety of different configurations.Thus, the detailed description of the embodiments is not intended tolimit the scope of the application as claimed but is merelyrepresentative of selected embodiments of the application.

One having ordinary skill in the art will readily understand that theabove may be practiced with steps in a different order, and/or withhardware elements in configurations that are different than those whichare disclosed. Therefore, although the application has been describedbased upon these preferred embodiments, it would be apparent to those ofskill in the art that certain modifications, variations, and alternativeconstructions would be apparent.

While preferred embodiments of the present application have beendescribed, it is to be understood that the embodiments described areillustrative only and the scope of the application is to be definedsolely by the appended claims when considered with a full range ofequivalents and modifications (e.g., protocols, hardware devices,software platforms etc.) thereto.

What is claimed is:
 1. A method, comprising: traveling, by a firsttransport, in a first lane; determining, by the first transport, that acurrent speed of a second transport is greater than a speed of the firsttransport when the second transport is behind the first transport; thatenough room exists in front of the first transport in the first lane forthe second transport to pass the first transport at the current speed ofthe second transport; determining, by the first transport, that no othertransports are beside the first transport by a second distance in asecond lane; and maneuvering, by the first transport, to the second laneallowing the second transport to pass the first transport in the firstlane; wherein an alert is sent to at least one occupant of the firsttransport when the first transport is moving below a speed limit and thefirst transport maneuvers to a third lane after one or more of a periodof time that the first transport is moving below the speed limit and anumber of the alerts being sent, wherein the third lane is a slowermoving lane than the first lane and the second lane.
 2. The method ofclaim 1, comprising traveling, by the first transport, in the secondlane when the first transport is moving at or around a speed limit. 3.The method of claim 1, comprising alerting one or more of the secondtransport and the other transports, by the first transport, to decreasethe speed of one or more of the second transport and the othertransports when the first transport is unable to move to the secondlane.
 4. The method of claim 1, comprising displaying a notification ona user interface of the first transport which indicates that the secondtransport desires to pass the first transport.
 5. The method of claim 1,comprising maneuvering, by the first transport, back to the first lanewhen there are no other transports traveling in the first lane at athird distance behind the first transport and at or near the speed ofthe second transport.
 6. The method of claim 1, comprising executing asmart contract of a blockchain network to validate one or more of thefirst transport, the second transport, the other transports ahead of thefirst transport, the other transports behind the first transport, thespeed of the first transport, the speed of the second transport, thefirst distance, the second distance, and the third distance, wherein oneor more of the first transport, the second transport, and the othertransports belong to the blockchain network.
 7. A system, comprising: aprocessor of a first transport in motion in a first lane; a memory onwhich are stored machine readable instructions that when executed by theprocessor, cause the processor to: determine that a current speed of asecond transport is greater than a speed of the first transport when thesecond transport is behind the first transport; determine that enoughroom exists in front of the first transport in the first lane for thesecond transport to pass the first transport at the current speed of thesecond transport; determine that no other transports are beside thefirst transport by a second distance in a second lane; and maneuver tothe second lane which allows the second transport to pass the firsttransport in the first lane; wherein an alert is sent to at least oneoccupant of the first transport when the first transport is in motionbelow a speed limit and the first transport maneuvers to a third laneafter one or more of a period of time that the first transport is inmotion below the speed limit and a number of the alerts sent, whereinthe third lane is a slower lane than the first lane and the second lane.8. The system of claim 7, wherein the instructions cause the processorto travel, in the second lane when the first transport is in motion ator around a speed limit.
 9. The system of claim 7, wherein theinstructions cause the processor to alert one or more of the secondtransport and the other transports, by the first transport, to decreasethe speed of one or more of the second transport and the othertransports when the first transport is unable to move to the secondlane.
 10. The system of claim 7, wherein the instructions cause theprocessor to maneuver to display a notification on a user interface ofthe first transport which indicates that the second transport desires topass the first transport.
 11. The system of claim 7, wherein theinstructions cause the processor to maneuver back to the first lane whenthere are no other transports traveling in the first lane at a thirddistance behind the first transport and at or near the speed of thesecond transport.
 12. The system of claim 7, wherein the instructionscause the processor to execute a smart contract of a blockchain networkto validate one or more of the first transport, the second transport,the other transports ahead of the first transport, the other transportsbehind the first transport, the speed of the first transport, the speedof the second transport, the first distance, the second distance, andthe third distance, wherein one or more of the first transport, thesecond transport, and the other transports belong to the blockchainnetwork.
 13. A non-transitory computer readable medium comprisinginstructions, that when read by a processor, cause the processor toperform: traveling, by a first transport, in a first lane; determining,by the first transport, that a current speed of a second transport isgreater than a speed of the first transport when the second transport isbehind the first transport; determining, by the first transport, thatenough room exists in front of the first transport in the first lane forthe second transport to pass the first transport at the current speed ofthe second transport; determining, by the first transport, that no othertransports are beside the first transport by a second distance in asecond lane; and maneuvering, by the first transport, to the second laneallowing the second transport to pass the first transport in the firstlane; wherein an alert to at least one occupant of the first transportwhen the first transport is moving below a speed limit and the firsttransport maneuvers to a third lane after one or more of a period oftime that the first transport is moving below the speed limit and anumber of the alerts being sent, wherein the third lane is a slowermoving lane than the first lane and the second lane.
 14. Thenon-transitory computer readable medium of claim 13, comprisingtraveling, by the first transport, in the second lane when the firsttransport is moving at or around a speed limit.
 15. The non-transitorycomputer readable medium of claim 13, comprising alerting one or more ofthe second transport and the other transports, by the first transport,to decrease the speed of one or more of the second transport and theother transports when the first transport is unable to move to thesecond lane.
 16. The non-transitory computer readable medium of claim13, comprising displaying a notification on a user interface of thefirst transport which indicates that the second transport desires topass the first transport.
 17. The non-transitory computer readablemedium of claim 13, comprising maneuvering, by the first transport, backto the first lane when there are no other transports traveling in thefirst lane at a third distance behind the first transport and at or nearthe speed of the second transport.